Degree distribution of a typical vertex in a general random intersection graph
نویسنده
چکیده
For a general random intersection graph we show an approximation of the vertex degree distribution by a Poisson mixture. key words: intersection graph, random graph, degree distribution
منابع مشابه
Degree Distributions in General Random Intersection Graphs
Random intersection graphs, denoted by G(n,m, p), are introduced in [9, 14] as opposed to classical Erdős-Rényi random graphs. Let us consider a set V with n vertices and another universal set W with m elements. Define a bipartite graph B(n,m, p) with independent vertex sets V and W . Edges between v ∈ V and w ∈ W exist independently with probability p. The random intersection graph G(n,m, p) d...
متن کاملLoglog distances in a power law random intersection graph
We consider the typical distance between vertices of the giant component of a random intersection graph having a power law (asymptotic) vertex degree distribution with infinite second moment. Given two vertices from the giant component we construct OP (log log n) upper bound for the length of the shortest path connecting them. key words: intersection graph, random graph, power law, giant compon...
متن کاملDegree Distribution of an Inhomogeneous Random Intersection Graph
We show the asymptotic degree distribution of the typical vertex of a sparse inhomogeneous random intersection graph.
متن کاملA random intersection digraph: Indegree and outdegree distributions
Let S(1), . . . , S(n), T (1), . . . , T (n) be random subsets of the set [m] = {1, . . . ,m}. We consider the random digraph D on the vertex set [n] defined as follows: the arc i → j is present in D whenever S(i)∩T (j) 6= ∅. Assuming that the pairs of sets (S(i), T (i)), 1 ≤ i ≤ n, are independent and identically distributed, we study the inand outdegree distributions of a typical vertex of D ...
متن کاملDegree and clustering coefficient in sparse random intersection graphs
We establish asymptotic vertex degree distribution and examine its relation to the clustering coefficient in two popular random intersection graph models of Godehardt and Jaworski (2001). For sparse graphs with positive clustering coefficient, we examine statistical dependence between the (local) clustering coefficient and the degree. Our results are mathematically rigorous. They are consistent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008